TSTP Solution File: DAT056^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : DAT056^1 : TPTP v8.1.2. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:38:42 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 14 unt; 14 typ; 0 def)
% Number of atoms : 34 ( 33 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 290 ( 10 ~; 10 |; 1 &; 266 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 56 ( 0 ^ 56 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
lst: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_22,type,
ap: lst > lst > lst ).
thf(decl_23,type,
cns: a > lst > lst ).
thf(decl_24,type,
nl: lst ).
thf(decl_25,type,
xs: lst ).
thf(decl_26,type,
esk1_0: lst ).
thf(decl_27,type,
esk2_0: lst ).
thf(decl_28,type,
esk3_0: a ).
thf(decl_29,type,
esk4_0: lst ).
thf(decl_30,type,
esk5_0: lst ).
thf(decl_31,type,
esk6_0: lst ).
thf(decl_32,type,
esk7_0: lst ).
thf(decl_33,type,
esk8_0: lst ).
thf(fact_0_lst_Oinduct_091where_AP_A_061_A_C_Fxs_O_AALL_Ays_Azs_O_Aap_Axs_A_Iap_Ays_Azs_J_A_061_Aap_A_Iap_Axs_Ays_J_Azs_C_093,axiom,
! [X1: lst] :
( ! [X2: lst,X3: lst] :
( ( ap @ nl @ ( ap @ X2 @ X3 ) )
= ( ap @ ( ap @ nl @ X2 ) @ X3 ) )
=> ( ! [X4: a,X5: lst] :
( ! [X6: lst,X7: lst] :
( ( ap @ X5 @ ( ap @ X6 @ X7 ) )
= ( ap @ ( ap @ X5 @ X6 ) @ X7 ) )
=> ! [X2: lst,X3: lst] :
( ( ap @ ( cns @ X4 @ X5 ) @ ( ap @ X2 @ X3 ) )
= ( ap @ ( ap @ ( cns @ X4 @ X5 ) @ X2 ) @ X3 ) ) )
=> ! [X6: lst,X7: lst] :
( ( ap @ X1 @ ( ap @ X6 @ X7 ) )
= ( ap @ ( ap @ X1 @ X6 ) @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JIbkmkaCJM/E---3.1_6872.p',fact_0_lst_Oinduct_091where_AP_A_061_A_C_Fxs_O_AALL_Ays_Azs_O_Aap_Axs_A_Iap_Ays_Azs_J_A_061_Aap_A_Iap_Axs_Ays_J_Azs_C_093) ).
thf(fact_2p_Osimps_I1_J,axiom,
! [X8: lst] :
( ( ap @ nl @ X8 )
= X8 ),
file('/export/starexec/sandbox/tmp/tmp.JIbkmkaCJM/E---3.1_6872.p',fact_2p_Osimps_I1_J) ).
thf(fact_1p_Osimps_I2_J,axiom,
! [X8: lst,X9: lst,X10: a] :
( ( ap @ ( cns @ X10 @ X9 ) @ X8 )
= ( cns @ X10 @ ( ap @ X9 @ X8 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JIbkmkaCJM/E---3.1_6872.p',fact_1p_Osimps_I2_J) ).
thf(conj_0,conjecture,
! [X2: lst,X3: lst] :
( ( ap @ xs @ ( ap @ X2 @ X3 ) )
= ( ap @ ( ap @ xs @ X2 ) @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.JIbkmkaCJM/E---3.1_6872.p',conj_0) ).
thf(c_0_4,plain,
! [X32: lst,X33: lst,X36: lst,X37: lst,X38: lst] :
( ( ( ( ap @ esk4_0 @ ( ap @ X32 @ X33 ) )
= ( ap @ ( ap @ esk4_0 @ X32 ) @ X33 ) )
| ( ( ap @ X36 @ ( ap @ X37 @ X38 ) )
= ( ap @ ( ap @ X36 @ X37 ) @ X38 ) )
| ( ( ap @ nl @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ nl @ esk1_0 ) @ esk2_0 ) ) )
& ( ( ( ap @ ( cns @ esk3_0 @ esk4_0 ) @ ( ap @ esk5_0 @ esk6_0 ) )
!= ( ap @ ( ap @ ( cns @ esk3_0 @ esk4_0 ) @ esk5_0 ) @ esk6_0 ) )
| ( ( ap @ X36 @ ( ap @ X37 @ X38 ) )
= ( ap @ ( ap @ X36 @ X37 ) @ X38 ) )
| ( ( ap @ nl @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ nl @ esk1_0 ) @ esk2_0 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_lst_Oinduct_091where_AP_A_061_A_C_Fxs_O_AALL_Ays_Azs_O_Aap_Axs_A_Iap_Ays_Azs_J_A_061_Aap_A_Iap_Axs_Ays_J_Azs_C_093])])])])])])]) ).
thf(c_0_5,plain,
! [X42: lst] :
( ( ap @ nl @ X42 )
= X42 ),
inference(variable_rename,[status(thm)],[fact_2p_Osimps_I1_J]) ).
thf(c_0_6,plain,
! [X1: lst,X2: lst,X3: lst,X5: lst,X6: lst] :
( ( ( ap @ esk4_0 @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ esk4_0 @ X1 ) @ X2 ) )
| ( ( ap @ X3 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X3 @ X5 ) @ X6 ) )
| ( ( ap @ nl @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ nl @ esk1_0 ) @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X1: lst] :
( ( ap @ nl @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X39: lst,X40: lst,X41: a] :
( ( ap @ ( cns @ X41 @ X40 ) @ X39 )
= ( cns @ X41 @ ( ap @ X40 @ X39 ) ) ),
inference(variable_rename,[status(thm)],[fact_1p_Osimps_I2_J]) ).
thf(c_0_9,plain,
! [X1: lst,X2: lst,X3: lst,X5: lst,X6: lst] :
( ( ( ap @ ( ap @ esk4_0 @ X1 ) @ X2 )
= ( ap @ esk4_0 @ ( ap @ X1 @ X2 ) ) )
| ( ( ap @ ( ap @ X3 @ X5 ) @ X6 )
= ( ap @ X3 @ ( ap @ X5 @ X6 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7])]) ).
thf(c_0_10,negated_conjecture,
~ ! [X2: lst,X3: lst] :
( ( ap @ xs @ ( ap @ X2 @ X3 ) )
= ( ap @ ( ap @ xs @ X2 ) @ X3 ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_11,plain,
! [X1: lst,X2: lst,X3: lst] :
( ( ( ap @ X1 @ ( ap @ X2 @ X3 ) )
= ( ap @ ( ap @ X1 @ X2 ) @ X3 ) )
| ( ( ap @ ( cns @ esk3_0 @ esk4_0 ) @ ( ap @ esk5_0 @ esk6_0 ) )
!= ( ap @ ( ap @ ( cns @ esk3_0 @ esk4_0 ) @ esk5_0 ) @ esk6_0 ) )
| ( ( ap @ nl @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ nl @ esk1_0 ) @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,plain,
! [X1: lst,X4: a,X2: lst] :
( ( ap @ ( cns @ X4 @ X1 ) @ X2 )
= ( cns @ X4 @ ( ap @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X1: lst,X2: lst] :
( ( ap @ ( ap @ esk4_0 @ X1 ) @ X2 )
= ( ap @ esk4_0 @ ( ap @ X1 @ X2 ) ) ),
inference(ef,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
( ( ap @ xs @ ( ap @ esk7_0 @ esk8_0 ) )
!= ( ap @ ( ap @ xs @ esk7_0 ) @ esk8_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
thf(c_0_15,plain,
! [X1: lst,X2: lst,X3: lst] :
( ( ( ap @ ( ap @ X1 @ X2 ) @ X3 )
= ( ap @ X1 @ ( ap @ X2 @ X3 ) ) )
| ( ( ap @ ( ap @ ( cns @ esk3_0 @ esk4_0 ) @ esk5_0 ) @ esk6_0 )
!= ( ap @ ( cns @ esk3_0 @ esk4_0 ) @ ( ap @ esk5_0 @ esk6_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7]),c_0_7])]) ).
thf(c_0_16,plain,
! [X1: lst,X4: a,X2: lst] :
( ( ap @ ( ap @ ( cns @ X4 @ esk4_0 ) @ X1 ) @ X2 )
= ( ap @ ( cns @ X4 @ esk4_0 ) @ ( ap @ X1 @ X2 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]),c_0_12]) ).
thf(c_0_17,negated_conjecture,
( ( ap @ xs @ ( ap @ esk7_0 @ esk8_0 ) )
!= ( ap @ ( ap @ xs @ esk7_0 ) @ esk8_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
! [X1: lst,X2: lst,X3: lst] :
( ( ap @ ( ap @ X1 @ X2 ) @ X3 )
= ( ap @ X1 @ ( ap @ X2 @ X3 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT056^1 : TPTP v8.1.2. Released v5.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 08:35:32 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.JIbkmkaCJM/E---3.1_6872.p
% 0.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.51 # full_lambda_5 with pid 6952 completed with status 0
% 0.22/0.51 # Result found by full_lambda_5
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGUPS-FFSF22-MFFFFFNN
% 0.22/0.51 # partial match(2): FUUPS-FFSF22-MFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 163s (1) cores
% 0.22/0.51 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 6955 completed with status 0
% 0.22/0.51 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGUPS-FFSF22-MFFFFFNN
% 0.22/0.51 # partial match(2): FUUPS-FFSF22-MFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 10
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 11
% 0.22/0.51 # Removed in clause preprocessing : 6
% 0.22/0.51 # Initial clauses in saturation : 5
% 0.22/0.51 # Processed clauses : 10
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 10
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 1
% 0.22/0.51 # Backward-rewritten : 4
% 0.22/0.51 # Generated clauses : 20
% 0.22/0.51 # ...of the previous two non-redundant : 13
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 18
% 0.22/0.51 # Factorizations : 2
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 22
% 0.22/0.51 # ...of those cached : 3
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 5
% 0.22/0.51 # Positive orientable unit clauses : 5
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 0
% 0.22/0.51 # Current number of unprocessed clauses: 6
% 0.22/0.51 # ...number of literals in the above : 12
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 5
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 1
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 5
% 0.22/0.51 # BW rewrite match successes : 5
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1088
% 0.22/0.51 # Search garbage collected termcells : 179
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.003 s
% 0.22/0.51 # Total time : 0.007 s
% 0.22/0.51 # Maximum resident set size: 1728 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.010 s
% 0.22/0.51 # Maximum resident set size: 1724 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------